Low Complexity -nlms Algorithms and Subband Structures for Stereophonic Acoustic Echo Cancellation

نویسندگان

  • Tetsuya Hoya
  • Jonathon A. Chambers
  • Patrick A. Naylor
چکیده

FOR STEREOPHONIC ACOUSTIC ECHO CANCELLATION Tetsuya Hoya, Jonathon A. Chambers, and Patrick A. Naylor Communications and Signal Processing Group, Department of Electrical and Electronic Engineering, Imperial College of Science, Technology, and Medicine, University of London SW7 2BT, U.K. e-mail: [email protected] ABSTRACT One of the fundamental problems in Stereophonic Acoustic Echo Cancellation (SAEC) lies in the misadjustment in the lter coe cients due to the two strongly correlated channel-inputs. In this paper, we study the e ect of the normalisation factor, , within the twochannel NLMS ( -NLMS) algorithm for subband SAEC and show that the optimal choice may be close to the variance of the channel-input data. In the simulation study with real speech datasets, it is observed that subband stereo echo cancellers using the Fast Least Squares (FLS) algorithm in lower bands and the -NLMS algorithm, with the optimal normalisation factor setting, in higher frequency bands can improve misalignment performance signi cantly compared with using only the FLS algorithm in all subbands. In addition, around 23dB further misalignment performance improvement is obtained by applying smoothly time-varying allpass lters in the lower frequency bands, while introducing no perceptible auditory degradation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Implementation of a Subband Adaptive Algorithm for Acoustic Echo Cancellation

The block subband adaptive algorithm in [1] has illustrated significant improvement in performance over the NLMS and other frequency domain adaptive algorithms. However, it is known that block processing algorithms have lower tracking capabilities than the their sample-by-sample counterparts. The Fast Affine Projection (FAP) algorithm [2] also outperforms the NLMS with a slight increase in comp...

متن کامل

Stereophonic Acoustic Echo Cancellation: Theory and Implementation

The thesis treats theory and implementation aspects for stereophonic acoustic echo cancellation. In Paper I a complete implementation of a stereophonic acoustic echo canceler based on the two-channel fast recursive least-squares algorithm is presented. An analysis of the system calculation complexity is also given, in addition to simulation results on recorded real-life data. Paper II presents ...

متن کامل

A Hybrid Frls/nlms Stereo Acoustic Echo Canceler

Teleconferencing systems employ acoustic echo cancelers to reduce echoes that results from the coupling between loudspeaker and microphone. To enhance the sound realism, two-channel audio is necessary. However, stereophonic acoustic echo cancellation is more difficult to solve because of the necessity to uniquely identify two acoustic paths, which becomes problematic since the two excitation si...

متن کامل

A Study of the - NLMS Algorithm

In Stereophonic Acoustic Echo Cancellation (SAEC), one of the fundamental problems lies in the misalignment in the lter coe cients due to the two strongly correlated channel-inputs. In this paper, we study the e ect of the normalisation factor, , upon the convergence properties of the two-channel Normalised Least Mean Square ( -NLMS) algorithm, through analysis and simulation studies with real ...

متن کامل

Acoustic echo cancellation for stereophonic systems derived from pairwise panning of monophonic speech

An algorithm is introduced that performs stereophonic acoustic echo cancellation (SAEC) for systems using pairwise panning of a single monophonic source to provide the effect of spatialisation. The technique exploits the inherent high correlation between the loudspeaker signals, unlike other general SAEC techniques, which try to utilise any small uncorrelated features in the signals. The algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999